A new lower bound for snake-in-the-box codes
نویسنده
چکیده
In this paper we give a new lower bound on the length of Snake-in-the-Box Codes, i.e., induced cycles in the d-dimensional cube. The bound is a linear function of the number of vertices of the cube and improves the bound c · 2/d, where c is a constant, proved by Danzer and Klee. AMS subject classification 1980: 05 C 35, 94 B 25
منابع مشابه
Discovering snake-in-the-box codes through pruning based on the exemplary solutions of an Evolutionary Algorithm
We present a method for searching for simple achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains exemplary snakes using an evolutionary algorithm previously responsible for defining the best-known lower bounds in n-cubes for n = 9, 10, 11, and 12. These snakes are used to define a pruning model that constrains the search space. A depth-first sea...
متن کاملNew Lower Bounds for the Snake-in-the-Box Problem: Using Evolutionary Techniques to Hunt for Snakes
The snake-in-the-box problem is a difficult problem in mathematics and computer science that was first described by Kautz in the late 1950’s (Kautz 1958). Snake-in-the-box codes have many applications in electrical engineering, coding theory, and computer network topologies. Generally, the longer the snake for a given dimension, the more useful it is in these applications (Klee 1970). By applyi...
متن کاملBuilding Snakes from Dna – a Step towards Generalizing the Snake in the Box Problem
The snake in the box problem is an NP-hard problem which has been a challenging problem for both computer scientists and mathematicians. It aims to maximize certain types of paths (snakes) in a graph, an n-dimensional hypercube while satisfying certain constraints described using the concept of spread. This thesis identifies a common pattern among the longest snakes which is very similar to the...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملSnake-in-the-Box Codes for Rank Modulation
Motivated by the rank-modulation scheme with applications to flash memory, we consider Gray codes capable of detecting a single error, also known as snake-in-the-box codes. We study two error metrics: Kendall’s τ-metric, which applies to charge-constrained errors, and the `∞-metric, which is useful in the case of limited-magnitude errors. In both cases we construct snake-in-the-box codes with r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 9 شماره
صفحات -
تاریخ انتشار 1989